A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems

In this paper, the problem of finding an assignment “n” surgeries to be presented in one “m” identical operating rooms (ORs) or machines as surgical case scheduling (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathematical and metaheuristic methods address OR problems used. The job operation ordering any a permanent part all sequencing problems. transportation times between defined based on type operations do not depend distance, so there no waiting time for transferring. These called no-wait open-shop (NWOSP) with times. system considered multi-transportation limitation number devices. Accordingly, study modeled novel combined (NWOSP-SCSP) first minimize maximum percentile makespan single objective model. A mixed-integer linear program (MILP) small-sized instances solved. addition model, hybrid simulated annealing (SA) algorithm solve large-sized acceptable computational suggested, considering comparison SA new recommended heuristic algorithm. Then, proposed algorithms compared their performance measurement. After reaching results numerical analysis Nova Scotia health authority hospitals centers, has generated significantly higher than